#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
#include<vector>
#include<unordered_map>

int removeDuplicates(vector<int>& nums)
{
    int l = 0, r = 1; //int n = nums.size(); 
    while (r < nums.size()-1)
    {
        if (nums[l] == nums[r] && nums[r] == nums[1 + r])
        {
            nums.erase(nums.begin() + l);
        }
        else
        {
            l++; r++;
        }
    }
    return nums.size();
}


int main()
{
    //vector<int> s1 = { 0,0,1,1,1,1,2,3,3 };
    //cout << removeDuplicates(s1);
    unordered_map<int, int> hash;
    hash[1]++; hash[1]++;
    cout <<hash.count(1);


	return 0;
}